Log-Barrier Decomposition Methods For Solving Stochastic Programs

نویسنده

  • Gongyun Zhao
چکیده

An algorithm incorporating the logarithmic barrier into the decomposition technique is proposed for solving stochastic programs. Basic properties concerning the existence and uniqueness of the solution and the underlying path are studied. The algorithm is shown to converge globally at the linear rate and to run in polynomial-time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Log-Barrier Method With Benders Decomposition For Solving Two-Stage Stochastic Programs

An algorithm incorporating the logarithmic barrier into the Benders decomposition technique is proposed for solving two-stage stochastic programs. Basic properties concerning the existence and uniqueness of the solution and the underlying path are studied. When applied to problems with a nite number of scenarios, the algorithm is shown to converge globally and to run in polynomial-time.

متن کامل

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse

Zhao [28] recently showed that the log barrier associated with the recourse function of twostage stochastic linear programs behaves as a strongly self-concordant barrier and forms a self concordant family on the first stage solutions. In this paper we show that the recourse function is also strongly self-concordant and forms a self concordant family for the two-stage stochastic convex quadratic...

متن کامل

A class of volumetric barrier decomposition algorithms for stochastic quadratic programming

Ariyawansa and Zhu have introduced a class of volumetric barrier decomposition algorithms [5] for solving two-stage stochastic semidefinite programs with recourse (SSDPs) [4]. In this paper we utilize their work for SSDPs to derive a class of volumetric barrier decomposition algorithms for solving two-stage stochastic quadratic programs with recourse and to establish polynomial complexity of ce...

متن کامل

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

On the implementation of a log-barrier progressive hedging method for multistage stochastic programs

A progressive hedging method incorporated with self-concordant barrier functions has been developed by Zhao [23] for solving multistage stochastic programs. The method relaxes the nonanticipativity constraints by the Lagrangian dual approach and smooths the Lagrangian dual function by self-concordant barrier functions. This paper discusses in detail the implementation of this method and reports...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997